Symbolic execution of floating-point computations
نویسندگان
چکیده
منابع مشابه
Symbolic execution of floating-point computations
Symbolic execution is a classical program testing technique which evaluates a selected control flow path with symbolic input data. A constraint solver can be used to enforce the satisfiability of the extracted path conditions as well as to derive test data. Whenever path conditions contain floating-point computations, a common strategy consists of using a constraint solver over the rationals or...
متن کاملSymbolic execution of oating point computations
Symbolic execution is a classical program testing technique which evaluates a se lected control ow path with symbolic input data A constraint solver can be used to enforce the satis ability of the extracted path conditions as well as to derive test data Whenever path conditions contain oating point computations a common strategy consists of using a constraint solver over the rationals or the re...
متن کاملFloating-point versus Symbolic Computations in theQD-algorithm
The convergence of columns in the univariate qd-algorithm to reciprocals of polar singularities of meromorphic functions has often proved to be very useful. Any q-column corresponding to a “simple pole of isolated modulus” converges to the reciprocal of the corresponding pole. By performing an equivalence transformation of the underlying corresponding continued fraction and programming the new ...
متن کاملFloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution
Recently there has been an upsurge of interest in both, Search– Based Software Testing (SBST), and Dynamic Symbolic Execution (DSE). Each of these two approaches has complementary strengths and weaknesses, making it a natural choice to explore the degree to which the strengths of one can be exploited to offset the weakness of the other. This paper introduces an augmented version of DSE that use...
متن کاملReproducible Parallel Floating-Point Computations
Because of rounding errors, floating-point operations such as addition and multiplication are not associative, computed results depend also on the order of computation. Therefore we cannot get the same answer from run-to-run even on the same machine with varying number of available processors. That makes understanding the reliability of output harder, especially with the increasing level of par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software Testing, Verification and Reliability
سال: 2006
ISSN: 0960-0833,1099-1689
DOI: 10.1002/stvr.333